On the Andrews-stanley Refinement of Ramanujan’s Partition Congruence modulo 5 and Generalizations
نویسندگان
چکیده
In a recent study of sign-balanced, labelled posets, Stanley introduced a new integral partition statistic srank(π) = O(π)−O(π′), where O(π) denotes the number of odd parts of the partition π and π′ is the conjugate of π. In a forthcoming paper, Andrews proved the following refinement of Ramanujan’s partition congruence mod 5: p0(5n+ 4) ≡ p2(5n+ 4) ≡ 0 (mod 5), p(n) = p0(n) + p2(n), where pi(n) (i = 0, 2) denotes the number of partitions of n with srank ≡ i (mod 4) and p(n) is the number of unrestricted partitions of n. Andrews asked for a partition statistic that would divide the partitions enumerated by pi(5n+ 4) (i = 0, 2) into five equinumerous classes. In this paper we discuss three such statistics: the ST-crank, the 2-quotientrank and the 5-core-crank. The first one, while new, is intimately related to the Andrews-Garvan (1988) crank. The second one is in terms of the 2-quotient of a partition. The third one was introduced by Garvan, Kim and Stanton in 1990. We use it in our combinatorial proof of the Andrews refinement. Remarkably, the Andrews result is a simple consequence of a stronger refinement of Ramanujan’s congruence mod 5. This more general refinement uses a new partition statistic which we term the BG-rank. We employ the BG-rank to prove new partition congruences modulo 5. Finally, we discuss some new formulas for partitions that are 5-cores and discuss an intriguing relation between 3-cores and the Andrews-Garvan crank.
منابع مشابه
Congruences for Andrews ’ Spt - Function modulo Powers of 5 , 7 and 13
Abstract. Congruences are found modulo powers of 5, 7 and 13 for Andrews’ smallest parts partition function spt(n). These congruences are reminiscent of Ramanujan’s partition congruences modulo powers of 5, 7 and 11. Recently, Ono proved explicit Ramanujan-type congruences for spt(n) modulo for all primes ≥ 5 which were conjectured earlier by the author. We extend Ono’s method to handle the pow...
متن کاملCongruences for Andrews’ Spt-function
Congruences are found modulo powers of 5, 7 and 13 for Andrews’ smallest parts partition function spt(n). These congruences are reminiscent of Ramanujan’s partition congruences modulo powers of 5, 7 and 11. Recently, Ono proved explicit Ramanujan-type congruences for spt(n) modulo ` for all primes ` ≥ 5 which were conjectured earlier by the author. We extend Ono’s method to handle the powers of...
متن کاملPartition congruences by involutions
We present a general construction of involutions on integer partitions which enable us to prove a number of modulo 2 partition congruences. Introduction The theory of partitions is a beautiful subject introduced by Euler over 250 years ago and is still under intense development [2]. Arguably, a turning point in its history was the invention of the “constructive partition theory” symbolized by F...
متن کاملOn a Partition Function of Richard Stanley
In this paper, we examine partitions π classified according to the number r(π) of odd parts in π and s(π) the number of odd parts in π′, the conjugate of π. The generating function for such partitions is obtained when the parts of π are all 5 N . From this a variety of corollaries follow including a Ramanujan type congruence for Stanley’s partition function t(n).
متن کاملGeneralization of a few results in Integer Partitions
In this paper, we generalize a few important results in Integer Partitions; namely the results known as Stanley’s theorem and Elder’s theorem, and the congruence results proposed by Ramanujan for the partition function. We generalize the results of Stanley and Elder from a fixed integer to an array of subsequent integers, and propose an analogue of Ramanujan’s congruence relations for the ‘numb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005